switching-circuit theory

switching-circuit theory
теория релейных схем

Англо-русский технический словарь.

Смотреть что такое "switching-circuit theory" в других словарях:

  • Circuit complexity — In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute them. A Boolean circuit with n input bits …   Wikipedia

  • Circuit minimization — In Boolean algebra, circuit minimization is the problem of obtaining the smallest logic circuit (Boolean formula) that represents a given Boolean function or truth table. The general circuit minimization problem is believed to be intractable,[1]… …   Wikipedia

  • Packet switching — is a digital networking communications method that groups all transmitted data – regardless of content, type, or structure – into suitably sized blocks, called packets. Packet switching features delivery of variable bit rate data streams… …   Wikipedia

  • Virtual circuit — In telecommunications and computer networks, a virtual circuit (VC), synonymous to virtual connection and virtual channel, is a connection oriented communication service that is delivered by means of packet mode communication. After a connection… …   Wikipedia

  • Network switching subsystem — (NSS) (or GSM core network) is the component of a GSM system that carries out call switching and mobility management functions for mobile phones roaming on the network of base stations. It is owned and deployed by mobile phone operators and… …   Wikipedia

  • Multiprotocol Label Switching — MPLS redirects here. For other uses, see Mpls. MPLS Layer Multiprotocol Label Switching (MPLS) is a mechanism in high performance telecommunications networks that directs data from one network node to the next based on short path labels rather… …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

  • Integrated circuit — Silicon chip redirects here. For the electronics magazine, see Silicon Chip. Integrated circuit from an EPROM memory microchip showing the memory blocks, the supporting circuitry and the fine silver wires which connect the integrated circuit die… …   Wikipedia

  • Shannon switching game — The Shannon switching game is an abstract strategy game for two players, invented by the father of information theory , Claude Shannon, and (at least in its common rectangular grid form) independently invented by David Gale; it has also been… …   Wikipedia

  • Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue …   Wikipedia

  • Sheila Greibach — (1939 ) is a researcher in formal languages, automata, compiler theory in particular; and computer science in general. She is currently Professor of Computer Science at the University of California, Los Angeles.She worked with Seymour Ginsburg… …   Wikipedia

Книги



Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»